Faster pattern matching with character classes using prime number encoding
نویسندگان
چکیده
منابع مشابه
Faster pattern matching with character classes using prime number encoding
In pattern matching with character classes the goal is to find all occurrences of a pattern of length m in a text of length n, where each pattern position consists of an allowed set of characters from a finite alphabet Σ. We present an FFT-based algorithm that uses a novel prime-numbers encoding scheme, which is log n/ log m times faster than the fastest extant approaches, which are based on bo...
متن کاملFaster Two Dimensional Pattern Matching with Rotations
The most efficient currently known algorithms for two dimensional pattern matching with rotations have a worst case time complexity of O(nm), where the size of the text is n × n and the size of the pattern is m × m. In this paper we present a new algorithm for the problem whose running time is O(nm).
متن کاملEfficient Algorithms for Pattern Matching with General Gaps and Character Classes
We develop efficient dynamic programming algorithms for a pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm−1, where pi ⊂ Σ, where Σ is some finite alphabet, and g(ai, bi) denotes a gap of length ai . . . bi between symbols pi and pi+1. The text symbol tj matches pi iff tj ∈ pi. Moreover, we require that if pi matches tj ,...
متن کاملFast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching
The problem of fast exact and approximate searching for a pattern that contains classes of characters and bounded size gaps (CBG) in a text has a wide range of applications, among which a very important one is protein pattern matching (for instance, one PROSITE protein site is associated with the CBG [RK] - x(2,3) - [DE] - x(2,3) - Y, where the brackets match any of the letters inside, and x(2,...
متن کاملFaster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm that uses the extended Dewey labelling scheme and reported better performance compared with other state-of-the-art holistic twig join algorithms, both in terms of number of elements scanned and stored during the compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2009
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2008.08.005